The Three-Dimensional Bin Packing Problem and Its Practical Algorithm.
نویسندگان
چکیده
منابع مشابه
The Three-Dimensional Bin Packing Problem
The problem addressed in this paper is that of orthogonally packing a given set of rectangular-shaped items into the minimum number of three-dimensional rectangular bins. The problem is strongly NP-hard and extremely diicult to solve in practice. Lower bounds are discussed, and it is proved that the asymptotic worst-case performance ratio of the continuous lower bound is 1 8. An exact algorithm...
متن کاملParallel Coevolutionary Algorithm for Three-Dimensional Bin Packing Problem
The work considers the problem of three-dimensional bin packaging (3D-BPP), where a load of maximum volume is put in a single container. To solve the above mentioned problem there was a coevolutionary parallel algorithm used basing on the separate evolution of cooperating subpopulations of possible solutions. Computational experiments were conducted in a neighbourhood of clusters and aimed to e...
متن کاملA Three-dimensional Bin Packing Algorithm
In this paper an approximation algorithm for the three-dimensional bin packing problem is proposed and its performance bound is investigated. To obtain such a bound a modified bin packing algorithm is considered for a two-dimensional problem with bounded bin and its area utilization is estimated. Finally, a hard example gives a lower bound of the performance bound. '
متن کاملThree-dimensional bin packing problem with variable bin height
This paper studies a variant of the three-dimensional bin packing problem (3D-BPP), where the bin height can be adjusted to the cartons it packs. The bins and cartons to be packed are assumed rectangular in shape. The cartons are allowed to be rotated into any one of the six positions that keep the carton edges parallel to the bin edges. This greatly increases the difficulty of finding a good s...
متن کاملA hybrid genetic algorithm with a new packing strategy for the three-dimensional bin packing problem
The three-dimensional bin packing problem is a practical problem faced in modern industrial processes such as container ship loading, pallet loading, plane cargo management, and warehouse management. This article considers a three-dimensional bin packing problem in which objects of various volumes are packed into a single bin to maximize the number of objects packed. The bin packing problem ini...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: JSME International Journal Series C
سال: 2003
ISSN: 1344-7653,1347-538X
DOI: 10.1299/jsmec.46.60